Portable data-parallel surface reconstruction on a uniform rectilinear grid
نویسندگان
چکیده
منابع مشابه
On Reconstruction from Non-uniform Spectral Data
Abstract This paper addresses the reconstruction of compactly supported functions from non-uniform samples of their Fourier transform. We briefly investigate the consequences of acquiring non-uniform spectral data. We summarize two often applied reconstruction methods, convolutional gridding and uniform re-sampling, and investigate the reconstruction accuracy as it relates to sampling density. ...
متن کاملHighly Parallel Surface Reconstruction
We present a parallel surface reconstruction algorithm that runs entirely on the GPU. Like existing implicit surface reconstruction methods, our algorithm first builds an octree for the given set of oriented points, then computes an implicit function over the space of the octree, and finally extracts an isosurface as a water-tight triangle mesh. A key component of our algorithm is a novel techn...
متن کاملParallel Poisson Surface Reconstruction
In this work we describe a parallel implementation of the Poisson Surface Reconstruction algorithm based on multigrid domain decomposition. We compare implementations using different models of data-sharing between processors and show that a parallel implementation with distributed memory provides the best scalability. Using our method, we are able to parallelize the reconstruction of models fro...
متن کاملGPU-Assisted Surface Reconstruction on Locally-Uniform Samples
In point-based graphics, surfaces are represented by point clouds without explicit connectivity. If the distribution of the points can be carefully controlled, surface reconstruction becomes a much easier problem. We present a simple, completely local surface reconstruction algorithm for input point distributions that are locally uniform. The locality of the computation lets us handle large poi...
متن کاملOn Parallel Rectilinear Obstacle-avoiding Paths
We give improved space and processor complexities for the problem of computing, in parallel, a data structure that supports queries about shortest rectilinear obstacleavoiding paths in the plane, where the obstacles are disjoint rectangles. That is, a query specifies any source and destination in the plane, and the data structure enables efficient processing of the query. We now can build the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Numerical Methods in Fluids
سال: 2017
ISSN: 0271-2091
DOI: 10.1002/fld.4410